Computation of the n-th decimal digit of π with low memory
نویسندگان
چکیده
This paper presents an algorithm that computes directly the n-th decimal digit of π in sub-quadratic time and very low memory. It improves previous results of Simon Plouffe, later refined by Fabrice Bellard. The problem of the n-th digit computation in base 2 had already been successfully treated thanks to the use of appropriate series, but no corresponding formula for the question in base 10 has been found yet. However, our result is a progress. Another result in this paper permits to compute directly the n-th decimal digit of π with intermediate memory size, leading to intermediate time complexity between linear and quadratic.
منابع مشابه
N-th digit computation
Xavier Gourdon and Pascal Sebah February 12, 2003 Is it possible to compute directly the n-th digit of π without computing all its first n digits ? At first sight, the problem seems of the same complexity. Recently [1], a formula which permits to find directly the n-th bit of π with very little memory and in quasi-linear time was exhibited. In other words, the question has a positive answer in ...
متن کاملOn the rapid computation of various polylogarithmic constants
We give algorithms for the computation of the d-th digit of certain transcendental numbers in various bases. These algorithms can be easily implemented (multiple precision arithmetic is not needed), require virtually no memory, and feature run times that scale nearly linearly with the order of the digit desired. They make it feasible to compute, for example, the billionth binary digit of log (2...
متن کاملSome Background on Kanada’s Recent Pi Calculation
in a similar way. This formula was used in numerous computations of π, culminating with Shanks’ computation of π to 707 decimal digits accuracy in 1873 (although it was later found that this result was in error after the 527-th decimal place). With the development of computer technology in the 1950s, π was computed to thousands and then millions of digits. These computations were facilitated by...
متن کاملParallel Implementation of Multiple-Precision Arithmetic and 1, 649, 267, 440, 000 Decimal Digits of π Calculation
We present efficient parallel algorithms for multiple-precision arithmetic operations of more than several million decimal digits on distributed-memory parallel computers. A parallel implementation of floating-point real FFT-based multiplication is used because a key operation in fast multiple-precision arithmetic is multiplication. We also parallelized an operation of releasing propagated carr...
متن کاملComparison of Effectiveness of Motor-Working Memory Training and Perceptual-Motor Exercises on Digit Span and Letter–Number Sequencing in Educable Children with Intellectual Disabilities
Background and Objective: Appropriate programs should be provided to improve the function of memory, learning, and the effects of processing efficiency in the daily life of children with intellectual disabilities. Therefore, the present study aimed to compare the effectiveness of motor-working memory training and perceptual-motor exercises on digit span and letter-number sequencing in educable ...
متن کامل